A Framework for Malay Computational Grammar Formalism based-on Enhanced Pola Grammar

Constraints Based Grammar Formalism for Japanese

The Japanese language has rather simple morphology and semanticsoriented syntax. It is also heavily context dependent in the sense that many constituents can be omitted. Thus we need to formalize Japanese grammar to take morphology, syntax, semantics and pragmatic factors into account. Based on CUProlog which is a constraint logic programming language, we have developed a grammar formalism for ...

A Comprehensive Unification-Based Grammar Formalism

A Learnable Constraint-based Grammar Formalism

Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable learnability results. The learnability result for LWFGs assumes that the semantic composition constraints are learnable. In this paper, we show what are the properties and principles the semantic representation and gramm...

Extensible dependency grammar: a modular grammar formalism based on multigraph description

What the thesis is about Extensible Dependency Grammar (XDG) new grammar formalism for natural language explores the combination of:

A New General Grammar Formalism for Parsing

We introduce Probabilistic Constrained W-grammars (PCWgrammars), a two-level formalism capable of capturing grammatical frameworks used in three different state of the art grammar formalism, namely Bilexical Grammars, Markov Rules, and Stochastic Tree Substitution Grammars. For each of them we provide an embedding into PCW-grammars, which allows us to derive properties about their expressive po...